Stability of weighted penalty-based aggregation functions

Stability of weighted penalty-based aggregation functions

In many practical applications, the need arises to aggregate data of varying dimension. Following from the self-identity property, some recent studies have looked at the stability of aggregation operators in terms of their behavior as the dimensionality is increased from n−1 to n. We use the penalty-based representation of aggregation functions in order to investigate the conditions for weighti...

study of hash functions based on chaotic maps

توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...

Evaluation of Penalty Functions for Semi-global Matching Cost Aggregation

The stereo matching method semi-global matching (SGM) relies on consistency constraints during the cost aggregation which are enforced by so-called penalty terms. This paper proposes new and evaluates four penalty functions for SGM. Due to mutual dependencies, two types of matching cost calculation, census and rank transform, are considered. Performance is measured using original and degenerate...

The weighted lattice polynomials as aggregation functions

In lattice theory, lattice polynomials have been defined as well-formed expressions involving variables linked by the lattice operations ∧ and ∨ in an arbitrary combination of parentheses. In turn, such expressions naturally define lattice polynomial functions. For instance, p(x1, x2, x3) = (x1 ∧ x2) ∨ x3 is a 3-ary lattice polynomial function. The concept of lattice polynomial function can be ...

Penalty Functions